Rate of convergence of local linearization schemes for initial-value problems

نویسندگان

  • Juan C. Jiménez
  • Felix Carbonell
چکیده

There is a large variety of Local Linearization (LL) schemes for the numerical integration of initial value problems, which differ with respect to the algorithm that is used in the numerical implementation of the Local Linear Discretization. However, in contrast with the LL Discretization, the order of convergence of the LL schemes have not been studied. In this paper, a general theorem about that matter is given. In addition, a brief survey of the main implementations of the LL method is also presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

روش پیش‌تعلیم سریع بر مبنای کمینه‌سازی خطا برای همگرائی یادگیری شبکه‌های‌ عصبی با ساختار عمیق

In this paper, we propose efficient method for pre-training of deep bottleneck neural network (DBNN). Pre-training is used for initial value of network weights convergence of DBNN is difficult because of different local minimums. While with efficient initial value for network weights can avoided some local minimums. This method divides DBNN to multi single hidden layer and adjusts them, then we...

متن کامل

The new implicit finite difference method for the solution of time fractional advection-dispersion equation

In this paper, a numerical solution of time fractional advection-dispersion equations are presented.The new implicit nite dierence methods for solving these equations are studied. We examinepractical numerical methods to solve a class of initial-boundary value fractional partial dierentialequations with variable coecients on a nite domain. Stability, consistency, and (therefore) convergenceof t...

متن کامل

Optimal Pareto Parametric Analysis of Two Dimensional Steady-State Heat Conduction Problems by MLPG Method

Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...

متن کامل

Nonlinear Numerical Integration Scheme in Strain Space Plasticity

Strains are applied to the integration procedure in nonlinear increments todecrease the errors arising from the linearization of plastic equations. Two deformationvectors are used to achieve this. The first vector is based on the deformations obtained bythe first iteration of the equilibrium step, and the second is acquired from the sum of thesucceeding iterations. By applying these vectors and...

متن کامل

Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis

We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 171  شماره 

صفحات  -

تاریخ انتشار 2005